Numerical Stablity of Path Tracing in Polyhedral Homotopy Continuation Methods

نویسندگان

  • Sunyoung Kim
  • Masakazu Kojima
چکیده

The reliability of polyhedral homotopy continuation methods for solving a polynomial system becomes increasingly important as the dimension of the polynomial system increases. High powers of the homotopy continuation parameter t and ill-conditioned Jacobian matrices encountered in tracing of homotopy paths affect the numerical stability. We present modified homotopy functions with a new homotopy continuation parameter s and various scaling strategies to enhance the numerical stability. Advantages of employing the new homotopy parameter s are discussed. Numerical results are included to illustrate the improved performance of the presented techniques. AMS subject classification. Primary: 65H10 Systems of equations Secondary: 65H20 Global methods, including homotopy approaches

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cmpsm : a Continuation Method for Polynomial Systems (matlab Version)

CMPSm is a MATLAB program using a predictor-corrector path-following method for tracing homotopy curves to approximate all isolated solutions of a system of polynomial equations. The program was originally developed for the cheater's homotopy, but it can be also used for linear and polyhedral homotopies. The software CMPSm, this manual and some numerical examples are available at

متن کامل

CMPSm : A Continuation Method for Polynomial Systems

CMPSm is a MATLAB program using a predictor-corrector path-following method for tracing homotopy curves to approximate all isolated solutions of a system of polynomial equations. The program was originally developed for cheater’s homotopy, but it can be also used for linear and polyhedral homotopies. The latest version CMPSm2 of this software, this manual and some numerical examples are availab...

متن کامل

Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods

Polyhedral homotopy continuation methods exploit the sparsity of polynomial systems so that the number of solution curves to reach all isolated solutions is optimal for generic systems. The numerical stability of tracing solution curves of polyhedral homotopies is mainly determined by the height of the powers of the continuation parameter. To reduce this height we propose a procedure that opera...

متن کامل

PHoM: Polyhedral Homotopy Continuation Method for Polynomial Systems

PHoM is a software package in C++ for finding all isolated solutions of polynomial systems using a polyhedral homotopy continuation method. Among three modules constituting the package, the first module StartSystem constructs a family of polyhedrallinear homotopy functions, based on the polyhedral homotopy theory, from input data for a given system of polynomial equations f(x) = 0. The second m...

متن کامل

Computing All Nonsingular Solutions of Cyclic-n Polynomial Using Polyhedral Homotopy Continuation Methods

All isolated solutions of the cyclic-n polynomial equations are not known for larger dimensions than 8 except the dimensions 10 and 11. We exploit two types of symmetric structures in the cyclic-n polynomial to compute all isolated nonsingular solutions of the equations efficiently by the polyhedral homotopy continuation method and to verify the correctness of the generated approximate solution...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003